Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("RECURSIVELY ENUMERABLE SET")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 153

  • Page / 7
Export

Selection :

  • and

The jump is definable in the structure of the degrees of unsolvabilityCOOPER, S. B.Bulletin, new series, of the American Mathematical Society. 1990, Vol 23, Num 1, pp 151-158, issn 0273-0979, 8 p.Article

DEGRES FAIBLEMENT ET RECURSIVEMENT ENUMERABLES ET CALCULABILITE LIMITEARSLANOV MM.1979; VEROJATN. METODY KIBERN.; SUN; DA. 1979; NO 15; PP. 3-9; BIBL. 6 REF.Article

THREE ASPECTS OF RECURSIVE ENUMERABILITY IN HIGHER TYPESSACKS GE.1980; LONDON MATH. SOC. LECTURE NOTE SER.; GBR; DA. 1980; NO 45; PP. 184-214; BIBL. 24 REF.Conference Paper

NUMERATIONS UNIVOQUES CALCULABLESGONCHAROV SS.1980; ALGEBRA LOG.; ISSN 0373-9252; SUN; DA. 1980; VOL. 19; NO 5; PP. 507-551; BIBL. 10 REF.Article

TROIS THEOREMES SUR LES (TT)-DEGRESDEGTEV AN.1978; ALGEBRA I LOGIKA; SUN; DA. 1978; VOL. 17; NO 3; PP. 270-281; BIBL. 9 REF.Article

HIGH RECURSIVELY ENUMERABLE DEGREES AND THE ANTI-CUPPING PROPERTYMILLER DP.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; VOL. 859; PP. 230-245; BIBL. 20 REF.Article

RETRACEABILITY, REPLETENESS AND BUSY BEAVER SETSDALEY RP.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 252-261; BIBL. 5 REF.Conference Paper

COMPUTATIONAL COMPLEXITY OF RECURSIVELY ENUMERABLE SETSSOARE RI.1982; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 52; NO 1; PP. 8-18; BIBL. 2 P.Article

SUR L'ALGEBRE DES OPERATEURS D'ENUMERATIONZAKHAROV SD.1982; VESTNIK MOSKOVSKOGO UNIVERSITETA. SERIJA 1: MATEMATIKA, MEHANIKA; ISSN 0579-9368; SUN; DA. 1982; NO 5; PP. 7-11; ABS. ENG; BIBL. 4 REF.Article

AUTOMORPHISMS OF THE LATTICE OF RECURSIVELY ENUMERABLE SETS. II: LOW SETSSOARE RI.1982; ANN. MATH. LOGIC; ISSN 0003-4843; NLD; DA. 1982; VOL. 22; NO 1; PP. 69-108; BIBL. 37 REF.Article

RESOLUBILITE DE LA THEORIE POUR TOUT IL EXISTE D'UN TREILLIS-QUOTIENT D'ENSEMBLES RECURSIVEMENT ENUMERABLESDEGTEV AN.1978; ALGEBRA I LOGIKA; SUN; DA. 1978; VOL. 17; NO 2; PP. 134-143; BIBL. 2 REF.Article

STRUCTURE D'UN SEMI-TREILLIS SUPERIEUR DE M-DEGRES RECURSIVEMENT ENUMERABLES ET QUESTIONS CONNEXES. 1DENISOV SD.1978; ALGEBRA I LOGIKA; SUN; DA. 1978; VOL. 17; NO 5; PP. 643-883; BIBL. 16 REF.Article

FLOW LANGUAGES EQUAL RECURSIVELY ENUMERABLE LANGUAGESARAKI T; TOKURA N.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 3; PP. 209-217; BIBL. 4 REF.Article

EXPRESSIVITE DANS LA THEORIE ELEMENTAIRE DES ENSEMBLES RECURSIVEMENT ENUMERABLES AVEC UNE LOGIQUE DE REALISABILITEPRANK RK.1981; ALGEBRA LOG.; ISSN 0373-9252; SUN; DA. 1981; VOL. 20; NO 4; PP. 427-439; BIBL. 7 REF.Article

ON THE SIMPLIFICATION OF CONSTRUCTIONS IN DEGREES OF INSOLVABILITY VIA COMPUTATIONAL COMPLEXITYDALEY RP.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 258-265; BIBL. 8 REF.Conference Paper

QUELQUES REMARQUES SUR LES CLASSES D'ENSEMBLES RECURSIVEMENT ENUMERABLESSELIVANOV VL.1978; SIBIR. MAT. ZH.; S.S.S.R.; DA. 1978; VOL. 19; NO 1; PP. 153-160; BIBL. 5 REF.Article

M-DEGRES MAXIMAUXKOVZEV GN.1977; SOOBSHCH. AKAD. NAUK GRUZ.S.S.R.; S.S.S.R.; DA. 1977; VOL. 85; NO 2; PP. 325-327; ABS. GEORGIEN ANGL.; BIBL. 2 REF.Article

REDUCTIBILITE SUIVANT L'ENUMERABILITEPOLYAKOV EA; ROZINAS MG.1977; SIBIR. MAT. ZH.; S.S.S.R.; DA. 1977; VOL. 18; NO 4; PP. 838-845; BIBL. 7 REF.Article

The limits of E-recursive enumerabilitySACKS, G. E.Annals of pure and applied logic. 1986, Vol 31, Num 1, pp 87-120, issn 0168-0072Article

Some properties of invariant setsBYERLY, R. E.The Journal of symbolic logic. 1984, Vol 49, Num 1, pp 9-21, issn 0022-4812Article

The intervals of the lattice of recursively enumerable sets determined by major subsetsMAASS, W; STOB, M.Annals of pure and applied logic. 1983, Vol 24, Num 2, pp 189-212, issn 0168-0072Article

THE POWER OF SYNCHRONIZING OPERATIONS ON STRINGSJANTZEN M.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 14; NO 2; PP. 127-154; BIBL. 15 REF.Article

THREE EASY CONSTRUCTION OF RECURSIVELY ENUMERABLE SETSJOCKUSCH CG JR.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; VOL. 859; PP. 83-91; BIBL. 13 REF.Article

MODULAR MACHINES, THE WORD PROBLEM FOR FINITELY PRESENTED GROUPS AND COLLINS' THEOREMAANDERAA S; COHEN DE.1980; STUD. LOGIC FOUND. MATH.; NLD; DA. 1980; VOL. 95; PP. 1-16; BIBL. 18 REF.Article

SUR UNE CATEGORIE DE FONCTIONS PARTIELLEMENT RECURSIVESDEGTEV AN.1980; SIBIR. MAT. ZH.; SUN; DA. 1980; VOL. 21; NO 3; PP. 88-97; BIBL. 5 REF.Article

  • Page / 7